A quantum approach to the discretizable molecular distance geometry problem

نویسندگان

چکیده

The Discretizable Molecular Distance Geometry Problem (DMDGP) aims to determine the three-dimensional protein structure using distance information from nuclear magnetic resonance experiments. DMDGP has a finite number of candidate solutions and can be solved by combinatorial methods. We describe quantum approach Grover's algorithm with an appropriate oracle function, which is more efficient than classical methods that use brute force. show computational results implementing our scheme on IBM computers small noisy qubits.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The discretizable molecular distance geometry problem

Given a simple weighted undirected graph G = (V,E, d) with d : E → R+, the Molecular Distance Geometry Problem (MDGP) consists in finding an embedding x : V → R such that ||xu −xv|| = duv for each {u, v} ∈ E. We show that under a few assumptions usually satisfied in proteins, the MDGP can be formulated as a search in a discrete space. We call this MDGP subclass the Discretizable MDGP (DMDGP). W...

متن کامل

The discretizable distance geometry problem

We introduce the Discretizable Distance Geometry Problem in R (DDGP3), which consists in a subclass of instances of the Distance Geometry Problem for which an embedding in R can be found by means of a discrete search. We show that the DDGP3 is a generalization of the Discretizable Molecular Distance Geometry Problem (DMDGP), and we discuss the main differences between the two problems. We prove...

متن کامل

A Clifford Algebra approach to the Discretizable Molecular Distance Geometry Problem

The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a subclass of the Molecular Distance Geometry Problem for which an embedding in R can be found using a Branch & Prune (BP) algorithm in a discrete search space. We propose a Clifford Algebra model of the DMDGP with an accompanying version of the BP algorithm.

متن کامل

Recent advances on the Discretizable Molecular Distance Geometry Problem

The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in R of a nonnegatively weighted simple undirected graph with the property that the Euclidean distances between embedded adjacent vertices must be the same as the corresponding edge weights. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a particular subset of the MDGP which can be solved using a d...

متن کامل

Polynomial cases of the Discretizable Molecular Distance Geometry Problem

An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge weights are equal to the Euclidean distances between corresponding point pairs. When the graph represents the backbone of a protein, one can exploit the natural vertex order to show that the search space for feasible...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information Processing

سال: 2022

ISSN: ['1573-1332', '1570-0755']

DOI: https://doi.org/10.1007/s11128-022-03583-w